De nability with Bounded Number of Bound Variables
نویسندگان
چکیده
A theory satis es the k variable property if every rst order formula is equivalent to a formula with at most k bound variables possibly reused Gabbay has shown that a model of temporal logic satis es the k variable property for some k if and only if there exists a nite basis for the temporal connectives over that model We give a model theoretic method for establishing the k variable property involving a restricted Ehrenfeucht Fraisse game in which each player has only k pebbles We use the method to unify and simplify results in the literature for linear orders We also establish new k variable properties for various theories of bounded degree trees and in each case obtain tight upper and lower bounds on k This gives the rst nite basis theorems for branching time models of temporal logic
منابع مشابه
On Parallel Hierarchies and Rik
This paper de nes natural hierarchies of function and relation classes, constructed from parallel complexity classes in a manner analogous to the polynomial-time hierarchy. A number of structural results about these classes are proven: relationships between them and the levels of PH; relationships between these classes and de nability in the bounded arithmetic theoriesR k; and several results r...
متن کاملSmoothness of Bounded Invariant Equivalence Relations
We generalise the main theorems from the paper The Borel cardinality of Lascar strong types by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between fundamental properties of bounded invariant equivalence relations (such as smoothness or type-de nability) which also requires nding a series of counterexample...
متن کاملOn the Number of Solutions Generated by Dantzig’s Simplex Method for LP with Bounded Variables∗
We give an upper bound for the number of different basic feasible solutions generated by Dantzig’s simplex method (the simplex method with the most negative pivoting rule) for LP with bounded variables by extending the result of Kitahara and Mizuno (2010). We refine the analysis by them and improve an upper bound for a standard form of LP. Then we utilize the improved bound for an LP with bound...
متن کاملStructure and De nability in General Bounded Arithmetic Theories
The bounded arithmetic theories R i 2 , S i 2 , and T i 2 are closely connected with complexity theory. This paper is motivated by the questions: what are the b i+1-deenable multifunctions of R i 2 ? and when is one theory conservative over another? To answer these questions we consider theories ^ R i 2 , ^ S i 2 , and ^ T i 2 where induction is restricted to prenex formulas. We also deene ^ T ...
متن کامل